A Certifying Algorithm for 3-Colorability of P5-Free Graphs
نویسندگان
چکیده
We provide a certifying algorithm for the problem of deciding whether a P5-free graph is 3-colorable by showing there are exactly six finite graphs that are P5-free and not 3-colorable and minimal with respect to this property.
منابع مشابه
Complexity of Coloring Graphs without Paths and Cycles
Let Pt and C` denote a path on t vertices and a cycle on ` vertices, respectively. In this paper we study the k-coloring problem for (Pt, C`)-free graphs. Maffray and Morel, and Bruce, Hoang and Sawada, have proved that 3-colorability of P5-free graphs has a finite forbidden induced subgraphs characterization, while Hoang, Moore, Recoskie, Sawada, and Vatshelle have shown that k-colorability of...
متن کاملCertifying coloring algorithms for graphs without long induced paths
Let Pk be a path, Ck a cycle on k vertices, and Kk,k a complete bipartite graph with k vertices on each side of the bipartition. We prove that (1) for any integers k, t > 0 and a graph H there are finitely many subgraph minimal graphs with no induced Pk and Kt,t that are not Hcolorable and (2) for any integer k > 4 there are finitely many subgraph minimal graphs with no induced Pk that are not ...
متن کاملA Note on k-Colorability of P5-Free Graphs
A polynomial time algorithm that determines whether or not, for a fixed k, a P5-free graph can be k-colored is presented in this paper. If such a coloring exists, the algorithm will produce a valid k-coloring.
متن کاملk-Colorability of P5-free graphs
A polynomial time algorithm that determines for a fixed integer whether or not a -free graph can be -colored is presented in this paper. If such a coloring exists, the algorithm will produce a valid -coloring.
متن کاملThree complexity results on coloring P k - free graphs I
We prove three complexity results on vertex coloring problems restricted to Pk-free graphs, i.e., graphs that do not contain a path on k vertices as an induced subgraph. First of all, we show that the pre-coloring extension version of 5-coloring remains NP-complete when restricted to P6-free graphs. Recent results of Hoàng et al. imply that this problem is polynomially solvable on P5-free graph...
متن کامل